Step of Proof: outl_wf |
12,41 |
|
Inference at * 1 1
Iof proof for Lemma outl wf:
1. A : Type
2. Type
3. x1 : A
4. True
outl(inl x1 )
A
by ((Reduce 0)
CollapseTHEN ((Auto_aux (first_nat 1:n) ((first_nat 1:n),(first_nat 4:n
C)) (first_tok :t) inil_term)))
C.